All binary linear codes that are invariant under PSL2(n)
نویسندگان
چکیده
The projective special linear group PSL2(n) is 2-transitive for all primes n and 3-homogeneous for n≡ 3 (mod 4) on the set {0,1, · · · ,n−1,∞}. It is known that the extended odd-like quadratic residue codes are invariant under PSL2(n). Hence, the extended quadratic residue codes hold an infinite family of 2-designs for primes n≡ 1 (mod 4), an infinite family of 3-designs for primes n≡ 3 (mod 4). To construct more t-designs with t ∈ {2,3}, one would search for other extended cyclic codes over finite fields that are invariant under the action of PSL2(n). The objective of this paper is to prove that the extended quadratic residue binary codes are the only nontrivial extended binary cyclic codes that are invariant under PSL2(n).
منابع مشابه
Genetic algorithms for finding the weight enumerator of binary linear block codes
In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the famous MacWilliams identity a linear system (S) of integer variables for which we add all known information obtained from the structure of the code. The knowl...
متن کامل4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...
متن کاملThe Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...
متن کاملTranslation-invariant propelinear codes
A class of binary group codes is investigated. These codes are the propelinear codes, deened over the Hamming metric space F n , F = f0; 1g, with a group structure. Generally, they are neither abelian nor translation invariant codes but they have good algebraic and com-binatorial properties. Linear codes and Z 4-linear codes can be seen as a subclass of prope-linear codes. Exactly, it is shown ...
متن کاملOn the symmetry of good nonlinear codes
It is shown that there are arbitrarily long “good” (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic codes are bad, and known that long al&e-invariant codes are bad. 1 T IS the object of this paper to show that there exist arbitrarily long bina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.01199 شماره
صفحات -
تاریخ انتشار 2017